Quantum extensive-form games

We propose a concept of quantum extensive-form games, which is extension classical games. Extensive-form games general such as Go, Shogi, and chess, have triggered the recent AI revolution, basis for many important game theoretic models in economics. Quantum transitions allow pairwise annihilation paths tree, resulting probability distribution that more likely to produce particular outcome. This similar principle mechanism speed-up by computation represented Grover’s algorithm. A also generalization learning, including Generative Adversarial Networks. As an new example we form Angel problem originally proposed Conway 1996. The has been solved but quantizing it, becomes non-trivial.